package com.leetcode.tree;

/**
 * @Author zhang.xin
 * @Description: TODO(这里描述)
 * @Date 2020/1/2
 */
public class Leetcode112 {

    public boolean hasPathSum(TreeNode root, int sum) {

        if (root == null) {
            return false;
        }

        sum -= root.val;
        if (root.left == null && root.right == null) {
            return sum == 0;
        }

        return hasPathSum(root.left, sum)
                || hasPathSum(root.right, sum);
    }

}
